EVOLVING A REPLICATOR The Genetic Programming of Self Reproduction in Cellular Automata

نویسنده

  • Hugo de Garis
چکیده

This paper presents the results of an investigative study into the evolution of cellular automata replicators using Genetic Programming (GP) techniques (i.e. using Genetic Algorithms (GAs) to build/evolve complex systems). There are at least two reasons why such a study might be considered interesting. One reason is to explore how difficult the evolution of (CA) replicators might be, a topic of importance for Artificial Life. Another reason is the possibility that the evolution of CAs, if successful, may provide tools for next-generation quantum-electronic computers (e.g. using "quantum dot arrays") which may use CAs as their operating principle.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Complex genetic evolution of artificial self-replicators in cellular automata

It is widely believed that evolutionary dynamics of artificial self-replicators realized in cellular automata (CA) are limited in diversity and adaptation. Contrary to this view, we show that complex genetic evolution may occur within simple CA. The evolving self-replicating loops (“evoloops”) we investigate exhibit significant diversity in macro-scale morphologies and mutational biases, underg...

متن کامل

Artificial Evolution of Arbitrary Self-Replicating Cellular Automata

Title of dissertation: ARTIFICIAL EVOLUTION OF ARBITRARY SELF-REPLICATING CELLULAR AUTOMATA Zhijian Pan Doctor of Philosophy, 2007 Dissertation directed by: Professor James Reggia Department of Computer Science Since John von Neumann’s seminal work on developing cellular automata models of self-replication, there have been numerous computational studies that have sought to create self-replicati...

متن کامل

Robot Path Planning Using Cellular Automata and Genetic Algorithm

In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...

متن کامل

A Cellular Learning Automata (CLA) Approach to Job Shop Scheduling Problem

Job shop scheduling problem (JSSP), as one of the NP-Hard combinatorial optimization problems, has attracted the attention of many researchers during the last four decades. The overall purpose regarding this problem is to minimize maximum completion time of jobs, known as makespan. This paper addresses an approach to evolving Cellular Learning Automata (CLA) in order to enable it to solve the J...

متن کامل

Optimization of Quantum Cellular Automata Circuits by Genetic Algorithm

Quantum cellular automata (QCA) enables performing arithmetic and logic operations at the molecular scale. This nanotechnology promises high device density, low power consumption and high computational power. Unlike the CMOS technology where the ON and OFF states of the transistors represent binary information, in QCA, data is represented by the charge configuration. The primary and basic devic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993